An universality argument for graph homomorphisms
نویسندگان
چکیده
1 Preliminary results were already reported at Bordeaux graph theory workshop 2012 [2]. 2 Supported by MŠMT ČR grant LH12095 and GAČR grant P202/12/G061. 3 Supported by grant ERC-CZ LL-1201 of the Czech Ministry of Education, CE-ITI of GAČR P202/12/G061 and the European Associated Laboratory “Structures in Combinatorics” (LEA STRUCO) P202/12/6061. 4 Email: [email protected] 5 Email: [email protected] 6 Email: [email protected] Available online at www.sciencedirect.com
منابع مشابه
Thinking as Evidence for the Probability of the Existence of a God: An Argument from Unnaturalness for Necessity
The objective of this article is to show that it is justified to assert that the existence of God is plausible, considering the fact that thinking itself is an immediate outcome (effect) of a thinker (cause). This idea may seem evident, but it is in fact challenged by certain claims of cognitive philosophers who aver that our knowledge of necessity and causation is, i...
متن کاملCounting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes
We consider the parameterized problem of counting all matchings with exactly k edges in a given input graph G. This problem is #W[1]-hard (Curticapean, ICALP 2013), so it is unlikely to admit f(k) · nO(1) time algorithms. We show that #W[1]-hardness persists even when the input graph G comes from restricted graph classes, such as line graphs and bipartite graphs of arbitrary constant girth and ...
متن کاملFractal property of the graph homomorphism order
We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this “fractal” property contributes to the spectacular properties of the homomorphism order. We first show the fractal property by using Sparse Incomparability Lemma and then by a more involved elementary argument.
متن کاملOn the Homomorphism Order of Labeled Posets
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This universal order is a distributive lattice. We investigate some other properties, namely the infinite distributivity, the computation of infinite suprema and...
متن کاملJudgment Aggregators and Boolean Algebra Homomorphisms
The theory of Boolean algebras can be fruitfully applied to judgment aggregation: Assuming universality, systematicity and a sufficiently rich agenda, there is a correspondence between (i) non-trivial deductively closed judgment aggregators and (ii) Boolean algebra homomorphisms defined on the power-set algebra of the electorate. Furthermore, there is a correspondence between (i) consistent com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 49 شماره
صفحات -
تاریخ انتشار 2015